منابع مشابه
Topologies, continuity and bisimulations
-The notion of a bisimulation relation is of basic importance in many areas of computation theory and logic. Of late, it has come to take a particular significance in work on the formal analysis and verification of hybrid control systems, based on the modal //-calculus. Our purpose here is to give an analysis of the concept, starting with the observation that the zig-zag conditions are suggesti...
متن کاملTheoretical Informatics and Applications Topologies, Continuity and Bisimulations *
The notion of a bisimulation relation is of basic importance in many areas of computation theory and logic. Of late, it has come to take a particular significance in work on the formal analysis and verification of hybrid control systems, where system properties are expressible by formulas of the modal μ-calculus or weaker temporal logics. Our purpose here is to give an analysis of the concept o...
متن کاملContinuity and Bisimulations
The notion of a bisimulation relation is of basic importance in many areas of computation theory and logic. Of late, it has come to take a particular signiicance in work on the formal analysis and veriication of hybrid control systems, where system properties are ex-pressible by formulas of the modal-calculus or weaker temporal logics. Our purpose here is to give an analysis of the concept of b...
متن کاملThe Characterization of the Continuity of Topologies
The following propositions are true: (1) Let S, T be non empty relational structures and f be a map from S into T . Suppose f is one-to-one and onto. Then f ·f−1 = idT and f −1 ·f = idS and f−1 is one-to-one and onto. (2) Let X, Y be non empty sets, Z be a non empty relational structure, S be a non empty relational substructure of Z [: X, Y :], T be a non empty relational substructure of (Z ) ,...
متن کاملBisimulations, Games and Logic
In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1999
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:1999123